A refinement calculus for tuple spaces
نویسندگان
چکیده
منابع مشابه
A Refinement Calculus for Tuple Spaces
It is fairly accepted that the realization of complex systems must be accomplished step by step from the initial speciication, through a sequence of intermediate phases, to the nal program. These development steps, linking a preliminary version, or description, of the program to a more detailed one, are usually called reenement steps, while the intermediate stages of a reenement process are cal...
متن کاملA refinement calculus for Z
The lack of a method for developing programs from Z specifications is a difficulty that is now widely recognised. As a contribution to solving this problem, we present ZRC, a refinement calculus based on Morgan's work that incorporates the Z notation and follows its style and con ventions. Other refinement techniques have been proposed fOr Z; ZRC builds upon some of them, but distiuguishes its...
متن کاملFrom Tuple Spaces to Tuple Centres 1
A tuple centre is a Linda-like tuple space whose behaviour can be programmed by means of transactional reactions to the standard communication events. This paper de nes the notion of tuple centre, and shows the impact of its adoption as a coordination medium for a distributed multi-agent system on both the system design and the overall system e ciency.
متن کاملWikis in Tuple Spaces
We consider storing the pages of a wiki in a tuple space and the effects this might have on the wiki experience. In particular, wiki pages are stored in tuples with a few identifying values such as title, author, revision date, content, etc. and pages are retrieved by sending the tuple space templates, such as one that gives the title but nothing else, leaving the tuple space to resolve to a si...
متن کاملCollective Sorting Tuple Spaces
Coordination of multiagent systems is recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and selforganisation are exploited in order to tackle openness, dynamism and unpredictability of typical multiagent systems applications. In this paper we focus on a coordination problem called collective sorting, where autonomous agents are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1999
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(98)00021-5